Modal Logics for Observation Equivalences

Modal Logics for Observation Equivalences

In our paper [RM02a] we describe an approach to weak bisimulation for coalgebras and show that parts of the theory of universal coalgebra (with strong bisimulation) can be obtained when considering coalgebras with weak bisimulations and weak homomorphisms. In the present paper we focus on uniformly adapting modal logics that characterise strong bisimulation for coalgebras to several kinds of ob...

A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems

Behavioral equivalences are a means to establish whether computing systems possess the same properties. The specific set of properties that are preserved by a specific behavioral equivalence clearly depends on how the system behavior is observed and can usually be characterized by means of a modal logic. In this paper we consider three different approaches to the definition of behavioral equiva...

Modal Logics for Coalgebras

This presentation is to introduce basic notions and recent results on an approach to specify behaviors of coalgebras by means of modal logics, based on the lecture by Dirk Pattinson (Pattinson, 2003) in NASSLLI 2003.

Modal Logics for Computer

Propositional Temporal Logics and Equivalences

We compare propositional temporal logics by comparing the equivalences that they induce on models. Linear time, branching time and partial order temporal logics are considered. The logics are interpreted on occurrence transition systems, generated by labelled prime event structures without auto-concurrency. The induced equivalences are also compared to directly deened equivalences, e.g., histor...